Proximity Curves for Potential-Based Clustering
نویسندگان
چکیده
منابع مشابه
MNV for Clustering based on Non Symmetric Symbolic Proximity
In this paper, we bring out the importance of nonsymmetric proximity values among symbolic objects in simulating the reality during clustering. The concept of Mutual Neighborhood Value (MNV) has been exploited on non-symmetric proximity values. The results of the experiments conducted reveal that the approaches based on non-symmetric proximity measures best suite the reality than the symmetric ...
متن کاملAdaptive robust clustering with proximity-based merging for video-summary
To allow efficient browsing of large image collection, we have to provide a summary of its visual content. We present in this paper a new robust approach to categorize image databases : Adaptive Robust Competition with Proximity-Based Merging (ARC-M). This algorithm relies on a non-supervised database categorization, coupled with a selection of prototypes in each resulting category. Each image ...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملPotential-Based Hierarchical Clustering
When performing hierarchical clustering, some metric must be used to determine the similarity between pairs of clusters. Traditional similarity metrics either can only deal with simple shapes or are very sensitive to outliers. We propose two potential-based similarity metrics, APES and AMAPES, inspired by the concept of electric potential in physics. The main features of these metrics are: the ...
متن کاملProximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as vertices. This graph is then partitioned (clustering) or used to redefine metric information (dimensionality reduction). There has been much recent work on new methods for graph-based clustering and dimensionality red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classification
سال: 2019
ISSN: 0176-4268,1432-1343
DOI: 10.1007/s00357-019-09348-y